The sample complexity of weighted sparse approximation

For Gaussian sampling matrices, we provide bounds on the minimal number of measurements m required to achieve robust weighted sparse recovery guarantees in terms of how well a given prior model for the sparsity support aligns with the true underlying support. Our main contribution is that for a sparse vector x ∈ R supported on an unknown set S ⊂ {1, 2, . . . , N} with |S| ≤ k, if S has weighted cardinality ω(S) := ∑ j∈S ω 2 j , and if the weights on S exhibit mild growth, ω j ≥ γ log(j/ω(S)) for γ > 0, then the sample complexity for sparse recovery via weighted `1-minimization using weights ωj is linear in the weighted sparsity level, andm = O(ω(S)/γ). This main result is a generalization of special cases including a) the standard sparse recovery setting where all weights ωj ≡ 1, and m = O (k log (N/k)); b) the setting where the support is known a priori, and m = O(k); and c) the setting of sparse recovery with prior information, and m depends on how well the weights are aligned with the support set S. We further extend the results in case c) to the setting of additive noise. Our results are nonuniform that is they apply for a fixed support, unknown a priori, and the weights on S do not all have to be smaller than the weights on S for our recovery results to hold.